Multicategory Classification by Support Vector Machines
نویسندگان
چکیده
We examine the problem of how to discriminate between objects of three or more classes. Specifically, we investigate how two-class discrimination methods can be extended to the multiclass case. We show how the linear programming (LP) approaches based on the work of Mangasarian and quadratic programming (QP) approaches based on Vapnik’s Support Vector Machines (SVM) can be combined to yield two new approaches to the multiclass problem. In LP multiclass discrimination, a single linear program is used to construct a piecewise linear classification function. In our proposed multiclass SVM method, a single quadratic program is used to construct a piecewise nonlinear classification function. Each piece of this function can take the form of a polynomial, radial basis function, or even a neural network. For the k > 2 class problems, the SVM method as originally proposed required the construction of a two-class SVM to separate each class from the remaining classes. Similarily, k two-class linear programs can be used for the multiclass problem. We performed an empirical study of the original LP method, the proposed k LP method, the proposed single QP method and the original k QP methods. We discuss the advantages and disadvantages of each approach.
منابع مشابه
One-against-all multicategory classification via discrete support vector machines
Discrete support vector machines (DSVM), recently proposed in [l01 and [ l l ] for binary classification problems, have been shown to outperform other competing approaches on well-known benchmark datasets. Here we address their extension to multicategory classification, by developing a one-against-all framework in which a set of binary discrimination problems are solved by means of DSVM. Comput...
متن کاملA moment inequality for multicategory support vector machines
The success of support vector machines in binary classification relies on the fact that hinge loss utilized in the risk minimization targets the Bayes rule. Recent research explores some extensions of this large margin based method to the multicategory case. We obtain a moment inequality for multicategory support vector machine loss minimizers with fast rate of convergence.
متن کاملReinforced Multicategory Support Vector Machines
Support vector machines are one of the most popular machine learning methods for classification. Despite its great success, the SVM was originally designed for binary classification. Extensions to the multicategory case are important for general classification problems. In this article, we propose a new class of multicategory hinge loss functions, namely reinforced hinge loss functions. Both th...
متن کاملClass-specific Variable Selection for Multicategory Support Vector Machines
This paper proposes a class-specific variable selection method for multicategory support vector machines (MSVMs). Different from existing variable selection methods for MSVMs, the proposed method not only captures the important variables for classification, but also identifies the discriminable and non discriminable classes so as to enhance the interpretation for multicategory classification pr...
متن کاملMulticategory Support Vector Machines
The Support Vector Machine (SVM) has shown great performance in practice as a classification methodology. Oftentimes multicategory problems have been treated as a series of binary problems in the SVM paradigm. Even though the SVM implements the optimal classification rule asymptotically in the binary case, solutions to a series of binary problems may not be optimal for the original multicategor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 12 شماره
صفحات -
تاریخ انتشار 1999